Arithmetic properties of the adjacency matrix of quadriculated disks
نویسندگان
چکیده
A quadriculated disk is a juxtaposition of finitely many squares along sides forming a closed topological disk such that vertices of squares which lie in the interior of the disk belong to precisely four squares. In this paper, by a square we mean a topological disk with four privileged boundary points, the vertices. A simple example of a quadriculated disk is the n ×m rectangle divided into unit squares. A quadriculated disk may be considered as a closed subset of the plane R.
منابع مشابه
Cut-and-paste of quadriculated disks and arithmetic properties of the adjacency matrix
We define cut-and-paste, a construction which, given a quadriculated disk obtains a disjoint union of quadriculated disks of smaller total area. We provide two examples of the use of this procedure as a recursive step. Tilings of a disk ∆ receive a parity : we construct a perfect or near-perfect matching of tilings of opposite parities. Let B∆ be the black-to-white adjacency matrix: we factor B...
متن کاملTHE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS
In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...
متن کاملQuantitative Correlation of Randić Indices and Adjacency Matrixes With Dewar Resonance Energy of Annulene Compounds
Topological indices are the numerical value associated with chemical constitution purporting for correlation ofchemical structure with various physical properties, chemical reactivity or biological activity. Graph theory is adelightful playground for the exploration of proof techniques in Discrete Mathematics and its results haveapplications in many areas of sciences. One of the useful indices ...
متن کاملStudy of fullerenes by their algebraic properties
The eigenvalues of a graph is the root of its characteristic polynomial. A fullerene F is a 3- connected graphs with entirely 12 pentagonal faces and n/2 -10 hexagonal faces, where n is the number of vertices of F. In this paper we investigate the eigenvalues of a class of fullerene graphs.
متن کاملDynamical networks reconstructed from time series
Novel method of reconstructing dynamical networks from empirically measured time series is proposed. By examining the variable–derivative correlation of network node pairs, we derive a simple equation that directly yields the adjacency matrix, assuming the intra-network interaction functions to be known. We illustrate the method on a simple example, and discuss the dependence of the reconstruct...
متن کامل